1207F - Remainder Problem - CodeForces Solution

//_   _ _   _ (_|_) __ _
//| | | | | | || | |/ _` |
//| |_| | |_| || | | (_| |
//\__, |\__,_|/ |_|\__,_|
//|___/     |__/
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=5e5+10;
const int mod=1e9+7;
int f[710][710];
// int dp[N][N],f[N][N];
int a[N],b[N];
int c[60][60][60][60];
void yujia(){
   int op,x,y;
   cin >> op >> x >> y;
   if(op==1)
   {
       for(int i=1;i<=707;i++)f[i][x%i]+=y;
       a[x]+=y;
   }
   else{
       if(x<=707)
           cout << f[x][y] << '\n';
       else{
           int sum=0;
           for(int i=y;i<=500000;i+=x){
               sum+=a[i];
           }
           cout << sum << '\n';
       }
   }
}

signed main(){
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int molinyuni=1;
    cin >> molinyuni;
    while(molinyuni--){
        yujia();
    }
    return 0;
}